A Declarative Formalism for Specifying Graphical Layout
نویسندگان
چکیده
This paper describes a new approach to specifying graphical layouts of arbitrary objects, which is based on a TEXlike notation. Our simplest scheme offers specifications similar to TEX’s box-and-glue metaphor. Size and position of boxes and glue can be specified by constraints. Advantages of this TEX-like formalism are its expressiveness, user-predictable layouts, and efficient implementation schemes for the underlying layout algorithms. We extend and generalize this forms-oriented scheme for specifying advanced graphical user interfaces (e.g. CLOS class browser).
منابع مشابه
Visualization and graphical layout in object-oriented systems
This report describes a new approach to visualizing program systems within the objectoriented paradigm. This approach is based on a TEX-like notation which has been extended and generalized for specifying graphical layout of arbitrary objects. Our simplest scheme offers specifications similar to TEX’s box-and-glue metaphor. Size and position of boxes and glue can be specified by constraints. Th...
متن کاملVisualization and Graphical Layout in Object - Oriented Systems ∗ Volker Haarslev
This report describes a new approach to visualizing program systems within the objectoriented paradigm. This approach is based on a TEX-like notation which has been extended and generalized for specifying graphical layout of arbitrary objects. Our simplest scheme offers specifications similar to TEX’s box-and-glue metaphor. Size and position of boxes and glue can be specified by constraints. Th...
متن کاملConstraints in Interactive Graphical Applications
Constraints provide a declarative means for specifying relationships that we wish to hold true. Interactive graphical applications give rise to varying kinds of constraints, and researchers have developed diverse constraint solving techniques. I survey the classes of constraints used by numerous drawing, graph layout, visualization and animation systems. I describe a taxonomy of the constraint ...
متن کاملUnit Testing in ASPIDE
Answer Set Programming (ASP) is a declarative logic programming formalism, which is employed nowadays in both academic and industrial real-world applications. Although some tools for supporting the development of ASP programs have been proposed in the last few years, the crucial task of testing ASP programs received less attention, and is an Achilles’ heel of the available programming environme...
متن کاملSmooth Animation of Algorithms in a Declarative Framework
Supporting smooth image transitions is a valuable feature in software visualization systems, but it seems difficult to achieve in declarative frameworks, as they are basically data (and not event) driven. This paper discusses the problem of specifying an animated behavior of graphical objects in a declarative style, addressing both automation and customization possibilities. In particular, in o...
متن کامل